TSTP Solution File: SET044^23 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET044^23 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:17:35 EDT 2024
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of formulae : 38 ( 16 unt; 12 typ; 0 def)
% Number of atoms : 94 ( 12 equ; 0 cnn)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 263 ( 30 ~; 25 |; 9 &; 187 @)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 49 ( 49 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 51 ( 31 ^ 16 !; 4 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_25,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_29,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
eiw_di: $i > mworld > $o ).
thf(decl_33,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
element: $i > $i > mworld > $o ).
thf(decl_37,type,
esk2_0: $i ).
thf(decl_38,type,
esk3_1: $i > $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',mlocal_def) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',mnot_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',mimplies_def) ).
thf(mequiv_def,axiom,
( mequiv
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
<=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',mequiv_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
! [X7: $i] :
( ( eiw_di @ X7 @ X3 )
=> ( X8 @ X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',mforall_di_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X9: $i > mworld > $o,X3: mworld] :
? [X7: $i] :
( ( eiw_di @ X7 @ X3 )
& ( X9 @ X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',mexists_di_def) ).
thf(pel40,conjecture,
( mlocal
@ ( mimplies
@ ( mexists_di
@ ^ [X10: $i] :
( mforall_di
@ ^ [X7: $i] : ( mequiv @ ( element @ X7 @ X10 ) @ ( element @ X7 @ X7 ) ) ) )
@ ( mnot
@ ( mforall_di
@ ^ [X11: $i] :
( mexists_di
@ ^ [X12: $i] :
( mforall_di
@ ^ [X13: $i] : ( mequiv @ ( element @ X13 @ X12 ) @ ( mnot @ ( element @ X13 @ X11 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p',pel40) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_10,plain,
( mequiv
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv_def]) ).
thf(c_0_11,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X7: $i] :
( ( eiw_di @ X7 @ Z1 )
=> ( Z0 @ X7 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_12,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X7: $i] :
( ( eiw_di @ X7 @ Z1 )
& ( Z0 @ X7 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_13,negated_conjecture,
~ ( ? [X24: $i] :
( ( eiw_di @ X24 @ mactual )
& ! [X23: $i] :
( ( eiw_di @ X23 @ mactual )
=> ( ( element @ X23 @ X24 @ mactual )
<=> ( element @ X23 @ X23 @ mactual ) ) ) )
=> ~ ! [X27: $i] :
( ( eiw_di @ X27 @ mactual )
=> ? [X26: $i] :
( ( eiw_di @ X26 @ mactual )
& ! [X25: $i] :
( ( eiw_di @ X25 @ mactual )
=> ( ( element @ X25 @ X26 @ mactual )
<=> ~ ( element @ X25 @ X27 @ mactual ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel40])]),c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
thf(c_0_14,negated_conjecture,
! [X38: $i,X39: $i,X41: $i] :
( ( eiw_di @ esk2_0 @ mactual )
& ( ~ ( element @ X38 @ esk2_0 @ mactual )
| ( element @ X38 @ X38 @ mactual )
| ~ ( eiw_di @ X38 @ mactual ) )
& ( ~ ( element @ X38 @ X38 @ mactual )
| ( element @ X38 @ esk2_0 @ mactual )
| ~ ( eiw_di @ X38 @ mactual ) )
& ( ( eiw_di @ ( esk3_1 @ X39 ) @ mactual )
| ~ ( eiw_di @ X39 @ mactual ) )
& ( ~ ( element @ X41 @ ( esk3_1 @ X39 ) @ mactual )
| ~ ( element @ X41 @ X39 @ mactual )
| ~ ( eiw_di @ X41 @ mactual )
| ~ ( eiw_di @ X39 @ mactual ) )
& ( ( element @ X41 @ X39 @ mactual )
| ( element @ X41 @ ( esk3_1 @ X39 ) @ mactual )
| ~ ( eiw_di @ X41 @ mactual )
| ~ ( eiw_di @ X39 @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
thf(c_0_15,negated_conjecture,
! [X7: $i] :
( ( element @ X7 @ esk2_0 @ mactual )
| ~ ( element @ X7 @ X7 @ mactual )
| ~ ( eiw_di @ X7 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X7: $i,X10: $i] :
( ( element @ X7 @ X10 @ mactual )
| ( element @ X7 @ ( esk3_1 @ X10 ) @ mactual )
| ~ ( eiw_di @ X7 @ mactual )
| ~ ( eiw_di @ X10 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X7: $i] :
( ( eiw_di @ ( esk3_1 @ X7 ) @ mactual )
| ~ ( eiw_di @ X7 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X7: $i] :
( ( element @ ( esk3_1 @ X7 ) @ esk2_0 @ mactual )
| ( element @ ( esk3_1 @ X7 ) @ X7 @ mactual )
| ~ ( eiw_di @ X7 @ mactual ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_19,negated_conjecture,
eiw_di @ esk2_0 @ mactual,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,negated_conjecture,
! [X7: $i] :
( ( element @ X7 @ X7 @ mactual )
| ~ ( element @ X7 @ esk2_0 @ mactual )
| ~ ( eiw_di @ X7 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_21,negated_conjecture,
element @ ( esk3_1 @ esk2_0 ) @ esk2_0 @ mactual,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X7: $i,X10: $i] :
( ~ ( element @ X7 @ ( esk3_1 @ X10 ) @ mactual )
| ~ ( element @ X7 @ X10 @ mactual )
| ~ ( eiw_di @ X7 @ mactual )
| ~ ( eiw_di @ X10 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_23,negated_conjecture,
( ( element @ ( esk3_1 @ esk2_0 ) @ ( esk3_1 @ esk2_0 ) @ mactual )
| ~ ( eiw_di @ ( esk3_1 @ esk2_0 ) @ mactual ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
~ ( eiw_di @ ( esk3_1 @ esk2_0 ) @ mactual ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_19])]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SET044^23 : TPTP v8.1.2. Released v8.1.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n016.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Fri May 3 10:49:30 EDT 2024
% 0.08/0.30 % CPUTime :
% 0.15/0.39 Running higher-order theorem proving
% 0.15/0.39 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rAaFttNbQh/E---3.1_7066.p
% 0.15/0.41 # Version: 3.1.0-ho
% 0.15/0.41 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.15/0.41 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.15/0.41 # Starting almost_fo_3_lam with 300s (1) cores
% 0.15/0.41 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.41 # post_as_ho1 with pid 7147 completed with status 0
% 0.15/0.41 # Result found by post_as_ho1
% 0.15/0.41 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.15/0.41 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.15/0.41 # Starting almost_fo_3_lam with 300s (1) cores
% 0.15/0.41 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: HGHNS-FFSF11-SHSSMFNN
% 0.15/0.41 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.15/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting new_ho_10 with 163s (1) cores
% 0.15/0.41 # new_ho_10 with pid 7152 completed with status 0
% 0.15/0.41 # Result found by new_ho_10
% 0.15/0.41 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.15/0.41 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.15/0.41 # Starting almost_fo_3_lam with 300s (1) cores
% 0.15/0.41 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: HGHNS-FFSF11-SHSSMFNN
% 0.15/0.41 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.15/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting new_ho_10 with 163s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 30
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 25
% 0.15/0.41 # Removed in clause preprocessing : 15
% 0.15/0.41 # Initial clauses in saturation : 10
% 0.15/0.41 # Processed clauses : 25
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 25
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 1
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 12
% 0.15/0.41 # ...of the previous two non-redundant : 7
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 1
% 0.15/0.41 # Paramodulations : 12
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Disequality decompositions : 0
% 0.15/0.41 # Total rewrite steps : 5
% 0.15/0.41 # ...of those cached : 2
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 14
% 0.15/0.41 # Positive orientable unit clauses : 4
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 1
% 0.15/0.41 # Non-unit-clauses : 9
% 0.15/0.41 # Current number of unprocessed clauses: 2
% 0.15/0.41 # ...number of literals in the above : 5
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 11
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 17
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 10
% 0.15/0.41 # Non-unit clause-clause subsumptions : 1
% 0.15/0.41 # Unit Clause-clause subsumption calls : 1
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 0
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 25
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 2130
% 0.15/0.41 # Search garbage collected termcells : 562
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.005 s
% 0.15/0.41 # System time : 0.001 s
% 0.15/0.41 # Total time : 0.006 s
% 0.15/0.41 # Maximum resident set size: 1884 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.005 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.009 s
% 0.15/0.41 # Maximum resident set size: 1752 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.41 % E exiting
%------------------------------------------------------------------------------